RUN CONCURRENT TRANSACTIONS IN A DATABASE MANAGEMENT SYSTEM MAY RESULT IN INCONSISTENCY. INCONSISTENCY IS AS THE RESULT OF INCORRECT VALUES THAT IS CREATED FOR DATA AVAILABLE AS A RESULT OF CONFLICT AND INTERFERENCE IN RUNNING TRANSACTIONS. CONCURRENCY CONTROL ALGORITHMS TO ENSURE CONCURRENT RUNNING OF MULTIPLE TRANSACTIONS ARE DESIGNED THAT WORK CONCURRENTLY WITH SHARED DATA. A GREAT DEAL OF RESEARCH HAS BEEN DONE IN THE FIELD OF DATABASE CONCURRENCY CONTROL, WHICH RESULTS IN VARIOUS CONCURRENCY CONTROL ALGORITHMS. A LOT OF STUDIES CAN BEEN DONE IN THE AREA OF EVALUATING CONCURRENCY CONTROL ALGORITHMS DUE TO VARIOUS ALGORITHMS IN THIS AREA AND THE FACT THAT ITS IMPORTANCE WILL INCREASE DAY BY DAY. IN THIS PAPER, FIRSTLY BASIC TWO-STAGE LOCKING CONCURRENCY CONTROL ALGORITHMS AS WELL AS TECHNIQUES OF WOUND - WAIT AND WAIT - DIE MODELED THAT INCLUDING THE TECHNIQUES OF PREVENTING DEADLOCK. SINCE THE COLORED PETRI NET HAVE HIGH MODELING CAPABILITIES AND ONE OF THE BEST WAYS TO ANALYZE THE CONCURRENCY CONTROL MECHANISMS; SO THAT MODELING WERE PROVIDED USING COLORED PETRI AND CPN TOOLS. A SIMPLE CASE STUDY WAS PRESENTED AS AN EXAMPLE TO BETTER UNDERSTAND WHICH INCLUDE THREE TRANSACTION AND TWO SOURCES. EVALUATION BASED ON THE PARAMETERS AND CRITERIA SUCH AS NUMBER OF TRANSACTIONS ENTERED INTO THE SYSTEM, THE NUMBER OF ORDERS FOR EACH TRANSACTION, THE NUMBER OF COMMON AND NON-COMMON DATA BETWEEN THE TRANSACTIONS AND THE NUMBER OF COMMON DATA IN TRANSACTIONS WITHOUT NON-COMMON DATA HAD TAKEN PLACE. BY COMPARING AND CONDUCTING SURVEYS, IT TURNED OUT THAT IN GENERAL, WOUND- WAIT ALGORITHM HAD BETTER RUNNING TIME COMPARED TO OTHER TWO ALGORITHMS. WAIT- DIE ALGORITHM IN TERMS OF RUN TIME WITH A LARGE DIFFERENCE WAS IN WORSE LEVEL COMPARED TO THE OTHER TWO ALGORITHMS AND BASIC TWO-PHASE LOCKING ALGORITHM DUE TO THE OCCURRENCE OF DEADLOCK HAD MANY PROBLEMS.